A Procedure for Allocating Zonal Attributes to a Link Network in a Gis Environment

نویسنده

  • Thomas Jonsson
چکیده

This paper presents a procedure for assigning zone data to links in the context of a Geographic Information System (GIS) environment. This may be used for several applications; the one motivating this paper is the need to approximate how much secondary traffic is accessing the main street network from adjacent zones. This will then be used in models to predict the number of accidents on the main road network. The full procedure consists of three sub-procedures: 1) The splitting of links into shorter segments that either are fully located within one zone or act as a border between the same two zones for their entire length, 2) Identification of all link segments either adjacent to or interior to each zone, and 3) Allocation of the zone attributes to the links associated with each zone, according to attributes of the zones and the links, as well as other information describing the area.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reliable multi-product multi-vehicle multi-type link logistics network design: A hybrid heuristic algorithm

This paper considers the reliable multi-product multi-vehicle multi-type link logistics network design problem (RMLNDP) with system disruptions, which is concerned with facilities locating, transshipment links constructing, and also allocating them to the customers in order to satisfy their demand on minimum expected total cost (including locating costs, link constructing costs, and also expect...

متن کامل

An Alternative Approach to Centroids and Connectors Pattern: Random Intra-Zonal Travel Time

In traditional traffic assignment procedure, each traffic analysis zone is represented by one point in its geometric center which is connected to the network by several connectors. Results of studies show that different connector patterns would result up to 10% change in estimated volume and up to 20% change in total travel time. Also the different patterns of connectors can change the priority...

متن کامل

Complete / Incomplete Hierarchical Hub Center Single Assignment Network Problem

In this paper we present the problem of designing a three level hub center network. In our network, the top level consists of a complete network where a direct link is between all central hubs.  The second and third levels consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. We model this problem in an incomplete net...

متن کامل

Reliable Designing of Capacitated Logistics Network with Multi Configuration Structure under Disruptions: A Hybrid Heuristic Based Sample Average Approximation Algorithm

We consider the reliable multi configuration capacitated logistics network design problem (RMCLNDP) with system disruptions, concerned with facilities locating, transportation links constructing, and also allocating their limited capacities to the customers in order to satisfy their demands with a minimum expected total cost (including locating costs, link constructing costs, as well as expecte...

متن کامل

A fuzzy model for achieving lean attributes for competitive advantages development using AHP-QFD-PROMETHEE

Lean production has become an integral part of the manufacturing landscape as its link with superior performance and its ability to provide competitive advantage is well accepted among academics and practitioners. Lean production helps producers in overcoming the challenges organizations face through using powerful tools and enablers. However, most companies are faced with restricted resources ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005